Parallel machine scheduling with minimum number of tardy jobs: Approximation and exponential algorithms
نویسندگان
چکیده
We consider the solution of some NP-hard parallel machine scheduling problems involving minimization weighted or unweighted number tardy jobs. first show that these cannot be approximated in polynomial time. Then we propose exponential-time approximation algorithms and fixed parameter tractable exact to solve them.
منابع مشابه
Metaheuristics for scheduling on parallel machine to minimize weighted number of early and tardy jobs
This paper considers the scheduling of n jobs on m parallel machines to minimize the weighted number of early and tardy jobs. The single machine case of this problem has been shown to be NPcomplete in the strong sense. This problem on m parallel machine is also NP complete in the strong sense and finding an optimal solution appears unlikely. The problem is formulated as an integer linear progra...
متن کاملMinimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints
In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...
متن کاملSingle-machine scheduling with trade-off between number of tardy jobs and compression cost
We consider a single-machine scheduling problem in which the job processing times are controllable or compressible. The performance criteria are the compression cost and the number of tardy jobs. For the problem where no tardy jobs are allowed and the objective is to minimize the total compression cost, we present a strongly polynomial time algorithm. For the problem to construct the trade-off ...
متن کاملBatch scheduling to minimize the weighted number of tardy jobs
In this paper, we address a single-machine scheduling problem with due dates and batch setup times to minimize the weighted number of tardy jobs. We give a pseudo-polynomial dynamic program and a fully-polynomial approximation scheme for the case where the due dates are uniform within a family. 2007 Elsevier Ltd. All rights reserved.
متن کاملMinimizing the number of tardy jobs in single machine scheduling using MIP
This paper considers the problem of scheduling n jobs on a single machine. A fixed processing time and an execution interval are associated with each job. Preemption is not allowed. The objective is to find a feasible job sequence that minimizes the number of tardy jobs. On the basis of an original mathematical integer programming formulation, this paper shows how both good-quality lower and up...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2021
ISSN: ['1873-5649', '0096-3003']
DOI: https://doi.org/10.1016/j.amc.2020.125888